Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
نویسندگان
چکیده
منابع مشابه
multi objective ordering planning for multi buyers deteriorating items
this paper is a research on the ordering planning of a supply chain with one supplier, multi buyer and multi deteriorating items. items have fixed life time and expire dates. the ordering period is taken as variable and must be computed the proposed models. the problem is studied via two different approaches the first is the joint replenishment, based on the hwang and chew's model [3] and ...
متن کاملAnalysis of Two Algorithms for Multi-objective Min-max Optimization
This paper presents two memetic algorithms to solve multi-objective min-max problems, such as the ones that arise in evidence-based robust optimization. Indeed, the solutions that minimize the design budgets are robust under epistemic uncertainty if they maximize the belief in the realization of the value of the design budgets. Thus robust solutions are found by minimizing with respect to the d...
متن کاملMin-max-min robust combinatorial optimization
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...
متن کاملMin-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty
We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...
متن کاملThresholded Covering Algorithms for Robust and Max-min Optimization
In a two-stage robust covering problem, one of several possible scenarios will appear tomorrow and require to be covered, but costs are higher tomorrow than today. What should you anticipatorily buy today, so that the worst-case cost (summed over both days) is minimized? We consider the k-robust model where the possible scenarios tomorrow are given by all demand-subsets of size k. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.11.048